Edge-Coloring Cliques with Three Colors on All 4-Cliques
نویسنده
چکیده
A coloring of the edges of Kn is constructed such that every copy of K4 has at least three colors on its edges. As n → ∞, the number of colors used is eO( √ log n ). This improves upon the previous probabilistic bound of O( √ n ) due to Erdős and Gyárfás.
منابع مشابه
Two-coloring with many monochromatic cliques in both colors
Color the edges of the n-vertex complete graph red and blue, and suppose that red kcliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than ckn , where ck ∈ (0, 1) is the unique root of the equation z = (1 − z) + kz(1 − z)k−1. On the other hand, we construct a coloring in which there are at least ckn k −O(nk−1) red k-cliques and at least the same numbe...
متن کاملTwo-colorings with many monochromatic cliques in both colors
Color the edges of the n-vertex complete graph in red and blue, and suppose that red k-cliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than ckn , where ck ∈ (0, 1) is the unique root of the equation z = (1 − z) + kz(1 − z)k−1. On the other hand, we construct a coloring in which there are at least ckn k −O(nk−1) red k-cliques and at least the same n...
متن کاملThreshold Functions for Asymmetric Ramsey Properties Involving Cliques
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if every Fi is the path P3 on 3 vertices, then we are looking for a proper k-edge-coloring of G, i.e., a coloring of the edges of G with no pair of edges of the same color incident to the same vertex. Rödl and Ruciński st...
متن کاملColoring the cliques of line graphs
The weak chromatic number , or clique chromatic number (CCHN) of a graph is the minimum number of colors in a vertex coloring, such that every maximal clique gets at least two colors. The weak chromatic index , or clique chromatic index (CCHI) of a graph is the CCHN of its line graph. Most of the results here are upper bounds for the CCHI, as functions of some other graph parameters, and contra...
متن کاملOnline Ramsey games for triangles in random graphs
In the online F -avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as it appears; his goal is to avoid a monochromatic copy of F . Let N0(F, r, n) be the threshold function for the number of edges that the player is asymptotically almost surely able to paint before he loses. Even when F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 18 شماره
صفحات -
تاریخ انتشار 1998